The Coupon Subset Collection Problem
نویسنده
چکیده
The coupon subset collection problem is a generalization of the classical coupon collecting problem, in that rather than collecting individual coupons we obtain, at each time point, a random subset of coupons. The problem of interest is to determine the expected number of subsets needed until each coupon is contained in at least one of these subsets. We provide bounds on this number, give efficient simulation procedures for estimating it, and then apply our results to a reliability problem.
منابع مشابه
The Hypergeometric Coupon Collection Problem and its Dual
Suppose an urn contains M balls, of different types, which are removed from the urn in a uniform random manner. In the hypergeometric coupon collection problem, we are interested in the set of balls that have been removed at the moment when at least one ball of each type has been removed. In its dual, we are interested in the set of removed balls at the first moment that this set contains all o...
متن کاملOptimal strategy of coupon subset collection when each package contains half of the coupons
The coupon subset collection is a generalization of the classical coupon collection, where instead of selecting (with replacement) a single coupon, a subset of at most k coupons (known as a “package”) is selected in each round. In this paper, we study how to design the collection of packages and assign probabilities to the packages, so as to minimize the expected number of rounds to collect all...
متن کاملContributions to the Generalized Coupon Collector and LRU Problems
Based upon inequalities on Subset Probabilities, proofs of several conjectures on the Generalized Coupon Collector Problem (i.e. CCP with unequal popularity) are presented. Then we derive a very simple asymptotic relation between the expectation of the waiting time for a partial collection in the CCP, and the Miss rate of a LRU cache.
متن کاملNew Results on a Generalized Coupon Collector Problem Using Markov Chains
We study in this paper a generalized coupon collector problem, which consists in determining the distribution and the moments of the time needed to collect a given number of distinct coupons that are drawn from a set of coupons with an arbitrary probability distribution. We suppose that a special coupon called the null coupon can be drawn but never belongs to any collection. In this context, we...
متن کاملCoupon Collecting with Quotas
We analyze a variant of the coupon collector’s problem, in which the probabilities of obtaining coupons and the numbers of coupons in a collection may be non-uniform. We obtain a finite expression for the generating function of the probabilities to complete a collection and show how this generalizes several previous results about the coupon collector’s problem. Also, we provide applications abo...
متن کامل